Santhanam, Rahul: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

3D printable concrete: Mixture design and test methods

Rahul, A.V., Santhanam, Manu, Meena, Hitesh, Ghani, Zimam

Journal:

Cement and Concrete Composites

Year:

2018

Language:

english

File:

PDF, 1.94 MB

english, 2018

2

Mechanical characterization of 3D printable concrete

Rahul, A.V., Santhanam, Manu, Meena, Hitesh, Ghani, Zimam

Journal:

Construction and Building Materials

Year:

2019

Language:

english

File:

PDF, 1.75 MB

english, 2019

3

Lower bounds on the complexity of recognizing SAT by Turing machines

Rahul Santhanam

Journal:

Information Processing Letters

Year:

2001

Language:

english

File:

PDF, 60 KB

english, 2001

4

A desorptivity-based approach for the assessment of phase separation during extrusion of cementitious materials

Rahul, A.V., Sharma, Abhishek, Santhanam, Manu

Journal:

Cement and Concrete Composites

Year:

2020

Language:

english

File:

PDF, 1.06 MB

english, 2020

5

Circuit Lower Bounds for Merlin–Arthur Classes

Santhanam, Rahul

Journal:

SIAM Journal on Computing

Year:

2009

Language:

english

File:

PDF, 325 KB

english, 2009

6

Graph splicing systems

Rahul Santhanam, Kamala Krithivasan

Journal:

Discrete Applied Mathematics

Year:

2006

Language:

english

File:

PDF, 632 KB

english, 2006

7

Evaluating the printability of concretes containing lightweight coarse aggregates

Rahul, A.V., Santhanam, Manu

Journal:

Cement and Concrete Composites

Year:

2020

File:

PDF, 408 KB

2020

8

[IEEE 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Baltimore, MD, USA (2019.11.9-2019.11.12)] 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - Why are Proof Complexity Lower Bounds Hard?

Pich, Jan, Santhanam, Rahul

Year:

2019

File:

PDF, 339 KB

2019

9

Holographic Proofs and Derandomization

van Melkebeek, Dieter, Santhanam, Rahul

Journal:

SIAM Journal on Computing

Year:

2005

Language:

english

File:

PDF, 316 KB

english, 2005

10

Robust Simulations and Significant Separations

Fortnow, Lance, Santhanam, Rahul

Journal:

Information and Computation

Year:

2017

Language:

english

File:

PDF, 310 KB

english, 2017

11

[ACM Press the 2016 ACM Conference - Cambridge, Massachusetts, USA (2016.01.14-2016.01.17)] Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science - ITCS '16 - Satisfiability on Mixed Instances

Chen, Ruiwen, Santhanam, Rahul

Year:

2016

Language:

english

File:

PDF, 853 KB

english, 2016

12

Permanent does not have succinct polynomial size arithmetic circuits of constant depth

Maurice Jansen, Rahul Santhanam

Journal:

Information and Computation

Year:

2013

Language:

english

File:

PDF, 287 KB

english, 2013

13

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability

Santhanam, Rahul

Year:

2010

Language:

english

File:

PDF, 555 KB

english, 2010

14

[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - Infeasibility of instance compression and succinct PCPs for NP

Fortnow, Lance, Santhanam, Rahul

Year:

2008

Language:

english

File:

PDF, 242 KB

english, 2008

15

[ACM Press the 23rd international conference - Pittsburgh, Pennsylvania (2006.06.25-2006.06.29)] Proceedings of the 23rd international conference on Machine learning - ICML '06 - Graph model selection using maximum likelihood

Bezáková, Ivona, Kalai, Adam, Santhanam, Rahul

Year:

2006

Language:

english

File:

PDF, 378 KB

english, 2006

16

The Complexity of Explicit Constructions

Rahul Santhanam

Journal:

Theory of Computing Systems

Year:

2012

Language:

english

File:

PDF, 508 KB

english, 2012

17

[ACM Press the thirty-ninth annual ACM symposium - San Diego, California, USA (2007.06.11-2007.06.13)] Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 - Circuit lower bounds for Merlin-Arthur classes

Santhanam, Rahul

Year:

2007

Language:

english

File:

PDF, 258 KB

english, 2007

18

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Lower Bounds on Interactive Compressibility by Constant-Depth Circuits

Chattopadhyay, Arkadev, Santhanam, Rahul

Year:

2012

Language:

english

File:

PDF, 248 KB

english, 2012

19

Impact of COVID-19 pandemic on patients with SLE: results of a large multicentric survey from India

Goyal, Mohit, Patil, Pravin, Pathak, Himanshu, Santhanam, Sham, Goel, Anshul, Sharma, Vishnu, Pandey, Akshat, Gupta, Nikhil, Jain, Rahul, Akerkar, Shashank, Das, Parthajit, Dudam, Rajkiran, Mendiratta

Journal:

Annals of the Rheumatic Diseases

Year:

2020

File:

PDF, 245 KB

2020

20

The effect of specimen size on deterioration due to external sodium sulphate attack in full immersion studies

Fathima Suma, M., Santhanam, Manu, Rahul, A.V.

Journal:

Cement and Concrete Composites

Year:

2020

File:

PDF, 12.59 MB

2020

21

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Fixed-Polynomial Size Circuit Bounds

Fortnow, Lance, Santhanam, Rahul, Williams, Ryan

Year:

2009

Language:

english

File:

PDF, 302 KB

english, 2009

22

[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - Pseudodeterministic constructions in subexponential time

Oliveira, Igor C., Santhanam, Rahul

Year:

2017

Language:

english

File:

PDF, 790 KB

english, 2017

23

[IEEE 2013 IEEE Conference on Computational Complexity (CCC) - Stanford, CA, USA (2013.06.5-2013.06.7)] 2013 IEEE Conference on Computational Complexity - On Medium-Uniformity and Circuit Lower Bounds

Santhanam, Rahul, Williams, Ryan

Year:

2013

Language:

english

File:

PDF, 271 KB

english, 2013

24

Pebbles and Branching Programs for Tree Evaluation

Cook, Stephen, McKenzie, Pierre, Wehr, Dustin, Braverman, Mark, Santhanam, Rahul

Journal:

ACM Transactions on Computation Theory

Year:

2012

Language:

english

File:

PDF, 476 KB

english, 2012

25

[ACM Press the 3rd Innovations in Theoretical Computer Science Conference - Cambridge, Massachusetts (2012.01.08-2012.01.10)] Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12 - Marginal hitting sets imply super-polynomial lower bounds for permanent

Jansen, Maurice, Santhanam, Rahul

Year:

2012

Language:

english

File:

PDF, 510 KB

english, 2012

26

Benign pleomorphic adenoma of minor salivary gland showing perineural invasion: a rare entity

Jayaram, Rahul, Patel, Dipen, Santhanam, Vijay

Journal:

British Journal of Oral and Maxillofacial Surgery

Year:

2015

Language:

english

File:

PDF, 1.11 MB

english, 2015

27

Molecular prevalence and characterization of Hepatozoon ursi infection in Indian sloth bears (Melursus ursinus)

Rahul Mohanchandra Pawar, Anantula Poornachandar, Attur Shanmugam Arun, Santhanam Manikandan, Sisinthy Shivaji

Journal:

Veterinary Parasitology

Year:

2011

Language:

english

File:

PDF, 279 KB

english, 2011

28

Infeasibility of instance compression and succinct PCPs for NP

Lance Fortnow, Rahul Santhanam

Journal:

Journal of Computer and System Sciences

Year:

2011

Language:

english

File:

PDF, 240 KB

english, 2011

29

Exponential Lower Bounds for AC 0 -Frege Imply Superpolynomial Frege Lower Bounds

Filmus, Yuval, Pitassi, Toniann, Santhanam, Rahul

Journal:

ACM Transactions on Computation Theory

Year:

2015

Language:

english

File:

PDF, 222 KB

english, 2015

30

Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012)

McGregor, Andrew, Santhanam, Rahul

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 41 KB

english, 2016

31

[IEEE 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Paris (2018.10.7-2018.10.9)] 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) - Hardness Magnification for Natural Problems

Carboni Oliveira, Igor, Santhanam, Rahul

Year:

2018

Language:

english

File:

PDF, 264 KB

english, 2018

32

On Uniformity and Circuit Lower Bounds

Santhanam, Rahul, Williams, Ryan

Journal:

Computational Complexity

Year:

2014

Language:

english

File:

PDF, 353 KB

english, 2014

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски